Ant colony optimization for finding the global minimum
نویسنده
چکیده
The ant colony optimization (ACO) algorithms are multi-agent systems in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem. This paper presents the ACO based algorithm to find global minimum. Algorithm is based on that each ant searches only around the best solution of the previous iteration. This algorithm was experimented on test problems, and successful results were obtained. The algorithm was compared with other methods which had been experimented on the same test problems, and observed to be better. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Estimation of Global Solar Irradiance Using a Novel combination of Ant Colony Optimization and Empirical Models
In this paper, a novel approach for the estimation of global solar irradiance is proposed based on a combination of empirical correlation and ant colony optimization. Empirical correlation has been used to estimate monthly average of daily global solar irradiance on a horizontal surface. The Ant Colony Optimization (ACO) algorithm has been applied as a swarm-intelligence technique to tune the c...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملOPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 219 شماره
صفحات -
تاریخ انتشار 2006